On NFAs where all states are final, initial, or both
نویسندگان
چکیده
We examine questions involving nondeterministic finite automata where all states are final, initial, or both initial and final. First, we prove hardness results for the nonuniversality and inequivalence problems for these NFAs. Next, we characterize the languages accepted. Finally, we discuss some state complexity problems involving such automata.
منابع مشابه
1 8 A ug 2 00 8 On NFAs Where All States are Final , Initial , or Both
We examine questions involving nondeterministic finite automata where all states are final, initial, or both initial and final. First, we prove hardness results for the nonuniversality and inequivalence problem for these NFAs. Next, we characterize the languages accepted. Finally, we discuss some state complexity problems involving such automata.
متن کاملOperations on Automata with All States Final
A language L is prefix-closed if w ∈ L implies that every prefix of w is in L. It is known that a regular language is prefix-closed if and only if it is accepted by a nondeterministic finite automaton (NFA) with all states final [18]. In the minimal incomplete deterministic finite automaton (DFA) for a prefix-closed language, all the states are final as well. The authors of [18] examined severa...
متن کاملDevelopment of a clinical feeding assessment scale for very young infants in South Africa
BACKGROUND There is a need for validated neonatal feeding assessment instruments in South Africa. A locally developed instrument may contribute to standardised evaluation procedures of high-risk neonates and address needs in resource constrained developing settings. OBJECTIVE The aim of the study was to develop and validate the content of a clinical feeding assessment scale to diagnose oropha...
متن کاملState Complexity of Nondeterministic Finite Automata with Limited Nondeterminism
Various approaches of quantifying nondeterminism in nondeterministic finite automata (NFA) are considered. We consider nondeterministic finite automata having finite tree width (ftw-NFA) where the computation on any input string has a constant number of branches. We give effective characterizations of ftw-NFAs and a tight bound for determinizing an ftw-NFA A as a function of the tree width and ...
متن کاملLimitations of Unary Finite Automata
NFA (Non-deterministic Finite Automata) usually require significantly less states than DFA (Deterministic Finite Automata) to recognize the same language. The power of NFA lies in its ability to be in many states simultaneously (i.e., in a subset of its state set). The usage of one letter input alphabet puts some restrictions on this ability of NFAs and decreases the gap between NFAs and DFAs. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 410 شماره
صفحات -
تاریخ انتشار 2009